Directed star decompositions of directed multigraphs
نویسندگان
چکیده
منابع مشابه
Implementation of directed multigraphs in Java
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission ...
متن کاملWDM and Directed Star Arboricity
A digraph is m-labelled if every arcs is labelled by an integer in {1, . . . , m}. Motivated by wavelength assignment for multicasts in optical star networks, we study n-fiber colourings of labelled digraph which are colourings of the arcs of D such that at each vertex v, for each colour in λ, in(v, λ) + out(v, λ) ≤ n with in(v, λ) the number of arcs coloured λ entering v and out(v, λ) the numb...
متن کاملDirected graphs, decompositions, and spatial linkages
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently intominimal pinned isostatic graphs, which we call d-Assur graphs. W...
متن کاملKathaa : NLP Systems as Edge-Labeled Directed Acyclic MultiGraphs
We present Kathaa, an Open Source web-based Visual Programming Framework for Natural Language Processing (NLP) Systems. Kathaa supports the design, execution and analysis of complex NLP systems by visually connecting NLP components from an easily extensible Module Library. It models NLP systems an edge-labeled Directed Acyclic MultiGraph, and lets the user use publicly co-created modules in the...
متن کاملDirected 3-cycle decompositions of complete directed graphs with quadratic leaves
Let G be a vertex-disjoint union of directed cycles in the complete directed graph Dt , let |E(G)| be the number of directed edges of G and suppose G 6= ⇀ C 2 ∪ ⇀ C 3 or ⇀ C 5 if t = 5, and G 6= ⇀ C 3 ∪ ⇀ C 3 if t = 6. It is proved in this paper that for each positive integer t , there exist ⇀ C 3-decompositions for Dt − G if and only if t(t − 1)− |E(G)| ≡ 0 (mod 3). © 2008 Elsevier B.V. All ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90428-5